Search and Placement in Tiered Cache Networks
نویسندگان
چکیده
منابع مشابه
Enabling opportunistic search and placement in cache networks
Content distribution networks have been extremely successful in today’s Internet. Despite their success, there are still a number of scalability and performance challenges that motivate clean slate solutions for content dissemination, such as content centric networking. In this paper, we address two of the fundamental problems faced by any content dissemination system: content search and conten...
متن کاملCache Placement Optimization in Hierarchical Networks: Analysis and Performance Evaluation
Caching popular content in the Internet has been recognized as one of the effective solution to alleviate network congestion and accelerate user information access. Sharing and coordinating in cache data placement provide an opportunity to improve system performance. This paper studies cache placement strategies and their performance in hierarchical network environments. A theoretical model is ...
متن کاملCache placement in sensor networks under an update cost constraint
In this paper, we address an optimization problem that arises in the context of cache placement in sensor networks. In particular, we consider the cache placement problem where the goal is to determine a set of nodes in the network to cache/store the given data item, such that the overall communication cost incurred in accessing the item is minimized, under the constraint that the total communi...
متن کاملContent Placement in Cache Networks Using Graph-Coloring
Small cell densification is one of the effective ideas addressing the demand for higher capacity in cellular networks. The major problem faced in such networks is the wireless backhaul link and its limited capacity. Caching most popular files in the memories of small cells base station (SBSs) is an effective solution to this problem. One of the main challenges in caching is choosing the files t...
متن کاملFlexible Content Placement in Cache Networks using Reinforced Counters
In this paper we study the problem of content placement in a cache network. We consider a network where routing of requests is based on random walks. Content placement is done using a novel mechanism referred to as “reinforced counters”. To each content we associate a counter, which is incremented every time the content is requested, and which is decremented at a fixed rate. We model and analys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2016
ISSN: 0163-5999
DOI: 10.1145/3003977.3003981